Pocket Cop

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GPR40: Good Cop, Bad Cop?

Since its deorphanization in 2003 (1,2), the fatty acid receptor GPR40 (FFAR1/FFA1) has drawn considerable attention as a potential therapeutic target for type 2 diabetes. Because fatty acids acutely amplify insulin secretion only in the presence of glucose, the discovery of a “drugable” cell surface receptor whose activation glucose-dependently enhances insulin release generated much interest ...

متن کامل

p53 Good Cop/Bad Cop

Activation of the p53 transcription factor in response to a variety of cellular stresses, including DNA damage and oncogene activation, initiates a program of gene expression that blocks the proliferative expansion of damaged cells. While the beneficial impact of the anticancer function of p53 is well established, several recent papers suggest that p53 activation may in some circumstances act i...

متن کامل

Good Cop, Bad Cop: Forcing Middleboxes to Cooperate

The original Internet architecture offered a clean contract to endpoints: packets sent will be delivered unmodified 1 or dropped when there is congestion. The proliferation of middleboxes has broken this simple contract to the point where the service the Internet provides to endpoints is entirely unpredictable: • Reachability depends on fields in the packet header and even the payload, as firew...

متن کامل

Discriminative MO-COP Operators

We address the problem of multi-objective constraint optimization problems (MO-COPs). Solving an MO-COP traditionally consists in computing the set of all Pareto solutions (i.e. the Pareto front). But this Pareto front is exponentially large in the general case. So this causes two main problems. First is the time complexity concerns. Second is a lack of decisiveness. In this paper, we present t...

متن کامل

On cop-win graphs

Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that in7nite chordal graphs, even of diameter two, need not be cop-win and point to some interesting questions, some of which we answer. c © 2002 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Science and Engineering

سال: 2019

ISSN: 2348-8387

DOI: 10.14445/23488387/ijcse-v6i3p104